#include <algorithm>
#include <iostream>
#include <bits/stdc++.h>
using namespace std;
#define int long long
signed main() {
int t;
cin>>t;
while(t--){
int n,k,q;
cin>>n>>k>>q;
int a[n];
int count =0;
int g=0;
for(int j=0;j<n;j++){
cin>>a[j];
}
for(int i : a){
if(i<=q){
count++;
}
else{
count=0;
}
if(count>=k){
g=g+count-k+1;
}
}
cout<<g<<endl;
}
return 0;
}
415. Add Strings | 22. Generate Parentheses |
13. Roman to Integer | 2. Add Two Numbers |
515. Find Largest Value in Each Tree Row | 345. Reverse Vowels of a String |
628. Maximum Product of Three Numbers | 1526A - Mean Inequality |
1526B - I Hate 1111 | 1881. Maximum Value after Insertion |
237. Delete Node in a Linked List | 27. Remove Element |
39. Combination Sum | 378. Kth Smallest Element in a Sorted Matrix |
162. Find Peak Element | 1529A - Eshag Loves Big Arrays |
19. Remove Nth Node From End of List | 925. Long Pressed Name |
1051. Height Checker | 695. Max Area of Island |
402. Remove K Digits | 97. Interleaving String |
543. Diameter of Binary Tree | 124. Binary Tree Maximum Path Sum |
1465. Maximum Area of a Piece of Cake After Horizontal and Vertical Cuts | 501A - Contest |
160A- Twins | 752. Open the Lock |
1535A - Fair Playoff | 1538F - Interesting Function |